Remark on “Algorithm 475: Visible Surface Plotting Program [J6]”
نویسندگان
چکیده
منابع مشابه
A Probabilistic Remark on Algebraic Program Testing
Until very recently, research in software reliability has divided quite neatly into two usually warring camps: methodologies with a mathematical basis and methodologies without such a basis. In the former view, “reliability” is identified wi+h “correctness” and the principle tocl has been formal and informal verification [ 11. In the latter view, “reliability” is taken to mean the ability to me...
متن کاملPlotting on Weibull Paper
This report explains Weibull plotting and its rationale. It shows how the two Weibull parameter estimates are easily read off from the Weibull plot. The use of Weibull plotting is introduced first in the context of complete samples and then extended to two common forms of censoring: type I or multiple censoring and type II censoring. Two blank Weibull plotting templates are provided, one for a ...
متن کاملICONGRAPH - Program package for interactive controller design by graphical plotting
Abstmet--ICONGRAPH is an interactive program package for CAD of control systems. The system under investigation has to be basically a linear single-loop one with lumped parameters. ICONGRAPH covers the following subjects: identification, design of controllers in the frequency and operator domains by minimia,'ing integral criteria, discrete controller design, blockoriented simulation, state-spac...
متن کاملNCIPLOT: a program for plotting non-covalent interaction regions.
Non-covalent interactions hold the key to understanding many chemical, biological, and technological problems. Describing these non-covalent interactions accurately, including their positions in real space, constitutes a first step in the process of decoupling the complex balance of forces that define non-covalent interactions. Because of the size of macromolecules, the most common approach has...
متن کاملRemark on Hsu-Du New Algorithm for the LCS Problem
One of the time bounds claimed by Hsu and Du for the modification of Hirschberg's strategy set up by them is not correct. This is of some consequence, notably, it voids the claim, made else~ where in the same paper, that the proposed algorithm performs better than the Hunt-Szymanski's strategy in cases of sparse matches. In fact it is pointed out here tbat just the opposite is true. In addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 1979
ISSN: 0098-3500,1557-7295
DOI: 10.1145/355853.355870